Reactive Kripke Semantics and Arc Accessibility
نویسنده
چکیده
Ordinary Kripke models are not reactive. When we evaluate (test/measure) a formula A at a model m, the model does not react, respond or change while we evaluate. The model is static and unchanged. This paper studies Kripke models which react to the evaluation process and change themselves during the process. This is reminiscent of game theoretic semantics where the two sides react to each other. However, reactive Kripke models do not go as far as that. The only additional device we add to Kripke semantics to make it reactive is to allow the accessibility relation to access itself. Thus the accessibility relation R of a reactive Kripke model contains not only pairs (a, b) ∈ R of possible worlds (b is accessible to a, i.e. there is an accessibility arc from a to b) but also pairs of the form (t, (a, b)) ∈ R, the arc (a, b) is accessible to t. This new kind of Kripke semantics allows us to characterise more axiomatic modal logics (with one modality ) by a class of reactive frames. There are logics which cannot be characterised by ordinary frames but which can be characterised by reactive frames. We use such models to fibre logics which disagree on their common language. 1 Motivation and Background Traditional modal logic uses possible world semantics with accessibility relation R. When we evaluate a formula such as B = 2 p∧ 3q in a Kripke model m = (S ,R, a, h) (S is the set of possible worlds, a ∈ S ,R ⊆ S 2 and h is the assignment) the model m does not change in the course of evaluation of B. We say the model m is not reactive. It stays the same during the process of evaluation. To make this point absolutely clear, consider the situation in Figure 1 below To evaluate a 3q, we have to check b 2q. We can also check another formula at b, say, b 2 p. In either case the world accessible to b are c and d. We do not say that since b 2q started its evaluation at world a as a 3q and continued to b 2q, then the accessible worlds to b are now different. In other words the model does not react to our starting the evaluation of a 3q by changing
منابع مشابه
Probabilistic Belief Logics
Modal logics based on Kripke style semantics are the prominent formalism in AI for modeling beliefs Kripke semantics involve a collection of possible worlds and a relation among the worlds called an accessibility relation Dependent on the properties of the accessibility relation di erent modal operators can be captured Belief operators have been modeled by an accessibility relation which produc...
متن کاملA Remark on Propositional Kripke Frames Sound for Intuitionistic Logic
Usually, in the Kripke semantics for intuitionistic propositional logic (or for superintuitionistic logics) partially ordered frames are used. Why? In this paper we propose an intrinsically intuitionistic motivation for that. Namely, we show that every Kripke frame (with an arbitrary accessibility relation), whose set of valid formulas is a superintuitionistic logic, is logically equivalent to ...
متن کاملReactive intuitionistic tableaux
We introduce reactive Kripke models for intuitionistic logic and show that the reactive semantics is stronger than the ordinary semantics. We develop Beth tableaux for the reactive semantics.
متن کاملOn modal extensions of Product fuzzy logic
In this paper we study modal extensions of Product fuzzy logic with both relational semantics based on Kripke structures with crisp accessibility relations and algebraic semantics, when the underlying product fuzzy logic is expanded with truth-constants, the ∆ operator and with two infinitary inference rules. We provide completeness results for both kinds of semantics. Finally, we also consider...
متن کاملModal Sequent Calculi Labelled with Truth Values: Completeness, Duality and Analyticity
Labelled sequent calculi are provided for a wide class of normal modal systems using truth values as labels. The rules for formula constructors are common to all modal systems. For each modal system, specific rules for truth values are provided that reflect the envisaged properties of the accessibility relation. Both local and global reasoning are supported. Strong completeness is proved for a ...
متن کامل